Robust efficient distributed RSA-key generation

ABSTRACT

The invention provides for robust efficient distributed generation of RSA keys. An efficient protocol is one which is independent of the primality test “circuit size”, while a robust protocol allows correct completion even in the presence of a minority of arbitrarily misbehaving malicious parties. The disclosed protocol is secure against any minority of malicious parties (which is optimal). The disclosed method is useful in establishing sensitive distributed cryptographic function sharing services (certification authorities, signature schemes with distributed trust, and key escrow authorities), as well as other applications besides RSA (namely: composite ElGamal, identification schemes, simultaneous bit exchange, etc.). The disclosed method can be combined with proactive function sharing techniques to establish the first efficient, optimal-resilience, robust and proactively-secure RSA-based distributed trust services where the key is never entrusted to a single entity (i.e., distributed trust totally “from scratch”). The disclosed method involves new efficient “robustness assurance techniques” which guarantee “correct computations” by mutually distrusting parties with malicious minority.

[0001] The application relates to the field of electronics and data processing, and particularly to methods and apparatus for generating cryptographic keys.

BACKGROUND

[0002] The notion of distributed cryptographic protocols has been in cryptography for over fifteen (15) years. Some protocols have been designed to solve communication problems which are impossible from an information-theoretic perspective, like the coin-flipping protocol [B82] and the millionaire-problem protocol [Y82]. Other protocols have been designed to solve generic problems. These protocols (called “general compiler protocols”) can securely compute any public function on secure inputs. The first such protocols were developed by Yao [Y86] and Goldreich, Micali and Wigderson [GMW], and various developments were made in subsequent works, e.g., [GHY, K, BGW, CCD].

[0003] Recently there has been a thrust to construct more efficient protocols for problems involving the distributed application of cryptographic functions (surveyed in GW97). Function sharing protocols are needed to provide increased memory security, distributed trust, and flexible management (i.e., adding and deleting trustees) of crucial functions like certification authorities and group signatures.

[0004] A major efficiency difference between a general compiler protocol (which should be thought of as a plausibility result—see [Gr97]) and a function sharing protocol results from the fact that the communication complexity of the former depends linearly on the actual size of the circuit computing the cryptographic functions, while the communication complexity of the latter is independent of the circuit size (and is typically a polynomial in the input/output size and the number of participants). This difference (pointed out first in FY93, DDFY94) is crucial to practitioners who require efficient protocols. A function sharing protocol involves a protocol for applying the function (based on distributed shares), and sometimes (in what is called a “proactive model”) also a protocol for re-randomizing the function shares.

[0005] Another important step regarding “distributed cryptographic functions” is the (efficient) distributed generation of the function (the key shares). For cryptographic functions based on modular exponentiation over a field (whose inverse is the discrete logarithm which is assumed to be a one-way function), a protocol for the distributed generation of keys was known [P2]. However, for the RSA function and related cryptographic functions to be described below, which requires the generation of a product of two primes and an inverse of a public exponent, this step was an open problem for many years. Note that Yao's central motivation [Y86] is introducing general compiler protocols that “computer circuits securely in communication” was the issue of distributed generation of RSA keys. Indeed the results of [Y86, GMW] show the plausibility of this task.

[0006] Another step forward was achieved by Boneh and Franklin [BF97] who showed how a set of participants can generate an RSA function efficiently, thus detouring the inefficient compiler. They showed that their protocol was secure in the limited model of “trusted but curious” parties. They left open the issue of robustness, i.e., generation in the presence of misbehaving (malicious) parties. If adversaries misbehave arbitrarily, the Boneh-Franklin protocol may be prevented from ever generating a shared RSA key (due to lack of robustness).

[0007] The following references provide additional background for the invention.

[0008] [ACGS] W. Alexi, B. Chor, O. Goldreich and C. Schnorr. RSA and Rabin Functions: Certain Parts are as Hard as the Whole. In SIAM Journal of Computing, volume 17, n. 2, pages 194-209, April 1988.

[0009] [B84] E. Bach, “Discrete Logarithms and Factoring”, Tech. Report No. UCB/CSD 84/186. Computer Science Division (EECS), University of California, Berkeley, Calif., June 1984.

[0010] [BGW] Ben-Or M., S. Goldwasser and A. Wigderson, Completeness Theorem for Non cryptographic Fault-tolerant Distributed Computing, STOC 1988, ACM, pp. 1-10.

[0011] [B82] M. Blum, “Coin flipping by telephone: a protocol for solving impossible problems,” IEEE Computer Conference 1982, 133-137.

[0012] [BF97] D. Boneh and M. Franklin, Efficient Generation of Shared RSA Keys, Crypto 97, pp. 425-439.

[0013] [B88] C. Boyd, Digital Multisignatures, IMA Conference on Cryptography and Coding, Claredon Press, 241-246 (eds. H. Baker and F. Piper), 1986.

[0014] [BCLL] G. Brassard, C. Crepeau, S. Laplante, C. Leger. Computationally Convincing proofs of knowledge, In Proceedings of the 8^(th) Symp. On Theoretical Aspects of Computer Science (Springer, Berlin, 1991), pp. 251-262.

[0015] [BGM] E. Brickell, D. Gordon and K. McCurley. Fast Exponentiation with Precomputation Advances in Cryptology—Eurocrypt 92 Proceedings, Lecture Notes in Computer Science, Vol. 658, R. Rueppel ed., Springer-Verlag, 1992.

[0016] [CCD] D. Chaum, C. Crepeau and I. Damgard, Multiparty Unconditionally Secure Protocols, STOC 1988, ACM, pp. 11-19.

[0017] [CEG] D. Chau, M. -H. Evertse and J. van de Graff, Multiparty computations ensuring privacy of each party's input and correctness of the result, Advances in Cryptology—Europcrypt 88 Proceedings, Lecture Notes in Computer Science, Vol. 330, C. Gunther ed., Springer-Verlag, 1988 pp. 87-119.

[0018] [CEGP] D. Chaum, J. -H. Evertse, J van de Graaf and R. Peralta, An improved protocol for demonstrating possession of discrete logarithms and some generalizations, Advances in Cryptology—Crypto 86 Proceedings, Lecture Notes in Computer Science, Vol. 263, A. Odlyzko ed., Springer-Verlag, 1986, pp. 200-212.

[0019] [CGMA] B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable Secret Sharing and Achieving Simultaneous Broadcast, Proceedings of the 26^(th) Symposium on Foundations of Computer Science, IEEE, 1985, pp. 335-344.

[0020] [DDFY94] A. DeSantis, Y. Desmedt, Y. Frankel and M. Yung, How to Share a Function Securely, ACM Proceedings of the 26^(th) Annual Symposium on Theory of Computing, ACM, 1994, pp. 522-533.

[0021] [DF89] Y. Desmedt and Y. Frankel, Threshold cryptosystems, Advances in Cryptology—Crypto 89 Proceedings, Lecture Notes in Computer Science, Vol. 435, G. Brassard ed., Springer-Verlag, 1989, pp. 307-315.

[0022] [DH] W. Diffle and M. Hellman, New Directions in Cryptography, IEEE Trans. On Information Theory 22(6), 1976, pp. 644-654.

[0023] [FFS] U. Feige, A. Fiat and A. Shamir, Zero-Knowledge Proof of Identity,. Proceedings of the Nineteenth annual ACM symp. Theory of Computing, 1987, pp. 210-217.

[0024] [F] P. Feldman, A Practical Scheme for Non-Interactive Certifiable Secret Sharing, Proceedings of the 28^(th) Symposium on Foundations of Computer Science, IEEE, 1987, pp. 427-437.

[0025] [FS86] A. Fiat and A. Shamir, “How to prove yourself: Practical solutions to identification and signature problems”, in Advances in Cryptology—CRYPTO '86 Proceedings (Lecture Notes in Computer Science, Vol. 263), ed. A. Odlyzko 186-194, Springer-Verlag, New York, 1987.

[0026] [FGY] Y. Frankel, P. Gemmell and M. Yung, Witness Based Cryptographic Program Checking and Robust Function Sharing, Proceedings of the 28^(th) Annual Symposium on Theory of Computing, ACM 1996, pp. 499-508.

[0027] [FGMY] Y. Frankel, P. Gemmel, P. MacKenzie and M. Yung, Proactive RSA, Crpto 97.

[0028] [FGMYa] Y. Frankel, P. Gemmel, P. MacKenzie and M. Yung, Optimal Resilience Proactive Public-Key Cryptosystems, FOCS 97.

[0029] [FS89] U. Feige and A. Shamir, Zero knowledge proofs of knowledge in two rounds, CRYPTO 1989, 20-24.

[0030] [FY93] M. Franklin and M. Yung, Secure and Efficient Off-line Digital Money, Porch. Of the 20^(th) Int. Col. On Automata, Languages and Programming (ICALP), 1993, LNCS 700, Springer-Verlag, pp. 265-276.

[0031] [GHY] Z. Galil, S. Haber, and M. Yung, Minimum-Knowledge Interactive Proof for Decision Problems, SIAM j. Comp., 18, 9189, pp. 711-739.

[0032] [GHY85] Z. Galil, S. Haber and M. Yung, Symmetric Public-Key Cryptography, Crypto 85.

[0033] [GHY87] Z. Galil, S. Haber and M. Yung, Cryptographic Computations: Secure Fault Tolerant Protocols in the Public Key Model, Crypto 87, pp. 135-155.

[0034] [GJKR] R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, Robust Threshold DSS Signatures, Advances in Cryptology—Eurocrypt 96 Proceedings, Lecture Notes in Computer Science, Vol. 1070, U. Maurer ed., Springer-Verlag, 1996, pp. 354-371.

[0035] [Gr97] O. Goldreich, On Foundations of Modern Cryptography, an invited paper, Crypto 97.

[0036] [GMW86] O. Goldreich, S. Micali and A. Wigderson, “Proofs that yield nothing but their validity and a methodology of cryptographic protocol design,” IEEE FOCS 1986, pp. 174-187.

[0037] [GMW] O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game, Proceedings of the Nineteenth annual ACM Symp. Theory of Computing, 1987, pp. 218-229.

[0038] [Gw97] S. Goldwasser, A New Direction in Cryptography: Twenty something years after, an invited paper, FOCS 97.

[0039] [GMR] A. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, Siam J. on Computing, 18(1) (1989), pp. 186-208.

[0040] [HW] G. Hardy and E. Wright, An introduction to the theory of numbers, Oxford Science Publications, London, Great Britain, fifth ed., 1985.

[0041] [HJJKY] A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, M. Yung, Proactive Public-Key and Signature Schemes, Proceedings of the Fourth Annual Conference on Computer and Communications Security, ACM, 1996.

[0042] [IY87] R. Impagliazzo, and M. Yung, “Direct minimum-knowledge computation,” in Advances in Cryptology—CRYPTO '87 Proceedings (Lecture Notes in Computer Science, Vol. 293), ed. C. Pomerance, 40-51, Springer-Verlag, New York, 1988.

[0043] [K] J. Kilian, “Founding cryptography on oblivious transfer,” ACM STOC 1988, 20-31.

[0044] [M76] G. Miller, Riemann's Hypothesis and Test of Primality, J. of Comp. And Syst. Sciences, 13, 300-317, 1976.

[0045] [OK92] T. Okamoto, Provably Secure and Practical Identification and Corresponding Signature Scheme, Advances in Cryptology—Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740, E. Brickell ed., Springer-Verlag, 1992, pp. 31-53.

[0046] [OY91] R. Ostrovsky and M. Yung, How to withstand mobile virus attacks, Proc. of the 10^(th) ACM Symposium on the Principles of Distributed Computing, 1991, pp. 51-61.

[0047] [P] T. P. Pedersen, Distributed Provers with Applications to Undeniable Signatures, Advances in Cryptology—Eurocrypt 91 Proceedings, Lecture Notes in Computer Science Vol. 547, D. Davies ed., Springer-Verglag, 1991, pp. 221-242.

[0048] [P2] T. P. Pedersen, A threshold cryptosystem without a trusted party, Advances in Cryptology—Eurocrypt 91 Proceedings, Lecture Notes in Computer Science Vol. 547, D. Davies ed., Springer-Verlag, 1991, pp. 129-140.

[0049] [P91] T. P. Pedersen, Non-interactive and information theoretic secure verifiable secret sharing, Advances in Cryptology—Crypto 91 Proceedings, Lecture Notes in Computer Science Vol. 576, J. Feigenbaum ed., Springer-Verlag, 1991, pp. 129-140.

[0050] [RSA] R. Rivest, A. Shamir and L. Adleman, A Method for Obtaining Digital Signature and Public Key Cryptosystems, Comm. of ACM, 21 (1978), pp. 120-126.

[0051] [Sh] A Shamir, How to share a secret, Comm. of ACM, 22 (1979), pp. 612-613.

[0052] [Y82a] A. C. Yao, Theory and Applications of Trapdoor functions, Proceedings of the 23rd Symposium on the Foundation of Computer Science, 1982, pp. 80-91.

[0053] [Y82] A. C. Yao, “Protocols for secure computations”, IEEE FOCS 1982, 160-164.

[0054] [Y86] A. C. Yao, “How to generate and exchange secrets”, IEEE FOCS 1986, 162-167.

SUMMARY

[0055] The preferred embodiment of the invention is a network of computers performing operations to generate a cryptographic key for use in an asymmetric (e.g., public/private) cryptosystem. The invention permits generation of a secret key by a group of computers. The process generates the key in the form of distributed shares in such a way that a (large enough) subset of computers have sufficient information to recover the key, and a subset of computers can perform cryptographic functions using the shares (e.g., signing a certificate). However, at no time during key share generation or key share use is the secret key actually formed. In one particularly preferred version, the method is secure against a number of misbehaving participants.

[0056] The preferred embodiment of the invention generates key shares for use in a cryptosystem that requires a number that is the product of two large prime numbers. The method proceeds generally in the following steps.

[0057] 1. Setup;

[0058] 2. Distributed generation of a value N;

[0059] 3. Evaluation of the value N for a property of double primality;

[0060] 4. Repetition of steps 2 and 3 as required;

[0061] 5. Generation of key shares.

[0062] The invention has particular utility in cryptographic applications requiring maximum security against both external and internal adversaries. Robustness assures proper operation in various system conditions like errors, failures, attacks with which a distributed system is supposed to cope.

BRIEF DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0063] Robustness has motivated basic notions in cryptography such as verifiable secret sharing [CGMA] and general zero-knowledge proofs [GMR]. The present invention provides for the robust, efficient and secure generation of shared RSA keys (or more generally, keys based on multiplying two large primes and exponentiation). It assumes a number n of participants that participate in generating shares of a cryptographic key. The participants may be programmed computers connected by a communication network. The method will successfully generate shares of a key for n≧2t+1, i.e., where at most t parties misbehave in any malicious and arbitrary way. The method achieves optimal resilience, since a majority of good participants is required. If n≧3t+1, a slightly more efficient variant of the protocol may be used.

[0064] Techniques of the present invention solve numerous other problems, because they can be employed to distributively initiate other cryptographic schemes based on composite numbers, such as: composite ElGamal encryption/signature, identification schemes where no participant is allowed to know the factorization of N (as in Feige, Fiat, Shamir [FFS]), and an efficient version of Yao's simultaneous bit exchange protocol [Y86].

[0065] The preferred embodiment of the invention is built upon the following novel techniques.

[0066] 1. Multiplication protocols for shared “sum-of-poly” representations of values drawn from (1) a prime field (with robustness and security based solely on the hardness of the discrete logarithm problem), or (2) a subset of the integers (with robustness and security based solely on the hardness of the RSA problem, but without requiring a shared RSA modulus). The technique has potential in other applications since it is information-theoretically secure but also produces publicly verifiable witnesses which are held by the “community of servers.”

[0067] 2. Techniques for “chained-consistency” of shared information and its associated checking information, i.e., forcing checking information to be consistent over various computational tasks (e.g., generation protocols, multiplication protocols, and double primality tests) even when the representation of that checking information changes.

[0068] This involves:

[0069] A. the idea of “cross-checking” information, i.e , maintaining consistency by verifying share information through check information, and moreover, verifying new checking information (perhaps a different representation) through share information. This duality of “checking and computing” is promising and is perhaps of independent interest;

[0070] B. efficient zero-knowledge arguments which verify that checking information is consistent;

[0071] C. a bootstrap technique assuring global checking by using a multitude of checking information w.r.t. individual keys.

[0072] Indeed, the techniques are general enough to cope with variations of many exponentiation-based cryptosystems and distributed protocols for applying these functions.

[0073] 3. A commitment mechanism, called Simulator-Equivocal Commitments, which are as secure and efficient as normal commitments, but allow for certain simultability arguments on committed data which could not be accomplished with standard commitments. The mechanism leads to a new proof technique of security for result-producing protocols.

[0074] The protocol described below assures that distributed systems employing the RSA function (and the other functions mentioned above) can be initiated distributively as well. The techniques developed here can be used to construct a robust threshold DSS as in [GJKR], but with optimal resilience and with no additional cryptographic assumptions. The protocol is implementable in hardware or software or both.

[0075] The protocol is relatively efficient (it does not depend on the size of the circuit of primality tests as in the general compilers). In addition, the number of rounds can be made about the same as the number of rounds in a non-robust protocol, and the computation complexity (measured in the number of modular exponentiations) can be brought to about 100 times the computational complexity of a non-robust protocol, given reasonable values for the number of shareholders and security requirements, and a few modifications for efficiency as also discussed below.

[0076] The protocol is feasible and can be used in system initiation and key replacement in numerous systems (as mentioned above) and in various settings which require distributed trust. For example, shared public key replacement in a certification authority may be performed every three or five years, and thus need not be a “real time” operation. Therefore, a somewhat long (say, two-three week) protocol is reasonable. On the other hand a general compiler protocol which will take more than the five year period itself is unreasonable.

GENERAL SYSTEM DESCRIPTION

[0077] The invention is preferably implemented in a network of computers. It has many advantages, particularly in terms of security against certain classes of adversaries as discussed below.

[0078] THE NETWORK: Preferred system uses a network of computers (shareholders) having properties satisfying the so-called “a model” similar to various recent works and also (BF97). The system has a group of n (probabilistic) servers, all connected to a common broadcast medium C, called the communication channel. Messages sent on C are assumed to instantly reach every party connected to it. The system is synchronized (and w.l.o.g. servers can be assumed to act synchronously). Implementations which satisfy the environment of the “model” can be based on known implementations of broadcast and multicast protocols, message sending protocols, encrypted and authenticated message sending protocols, and agreement protocols. These implementations are apparent based on the known and practiced art of computer communications (e.g., Computer Networks, Andrew Tanenbaum, Prentice-Hall, Inc., 1996).

[0079] THE ADVERSARY: The adversary is computationally bounded (i.e., it can not break the underlying cryptographic primitives) and it can corrupt servers at any moment by viewing the memories of corrupted servers and/or modifying their behavior. The adversary decides on whom to corrupt at the start of the protocol. It will be assume that the adversary corrupts no more than t out of n servers throughout the protocol, where n≧2t+1 (or n≧3t+1 for the more efficient protocol variant). For the purpose of classifying adversaries, malicious faults need not be differentiated from “normal” server failures (e.g., crashes). An adversaries can be connected to the broadcast channel C, which means it can hear all the messages and inject its own. It cannot, however, modify messages sent to C by a server that the adversary does not control, nor can it prevent a non-corrupted server from receiving a message sent on C.

[0080] In fact, the preferred protocol will be useful against a more mobile adversary [OY91], where the protocol proceeds in “trials” and each trial is independent of past trials. During a trial, misbehaving servers (including malicious adversaries) can be detected. A proper key can be generated, or the remaining servers (which were not caught deviating from the protocol) restart a new trial. Provided that the eliminated misbehaving servers till now are t′, the protocol permits generation of a proper key if the adversary occupies t-1-t′ new servers at the start of the new trial.

[0081] NOTATION: The description below will use the following notation. The term “sp” will be a security parameter, and the term H=2^((sp)). The subscripts “_(i)”, “_(j)”, and “_(k)” designate individual elements indexed within a vector, and the subscript “_(*)” designates the multitude of all elements in the vector (for describing parallel operations). The term N_(*) will be the product of two unknown primes, each in the range {square root}{square root over ( )}H, 2{square root}{square root over ( )}H. The terms g_(*) and h_(*) are generators whose discrete log mod N_(*) with respect to each other is unknown. Indeed finding such an N_(*) may be difficult, since that is the goal of the protocol.

[0082] In the description of the preferred protocol below, reference will be made to techniques known in the art for secret sharing [Sh], verifiable secret sharing [F], unconditionally secure verifiable secret sharing [P91], basic commitments using discrete logs over prime groups [P91], basic proofs of knowledge of discrete logs [GHY85, CEG, CEGP], and certain methods by which a number of parties can generate a random value by all committing to private random values, and then revealing those values. All publications referenced herein (both above and below) are hereby incorporated by reference in their entirety.

THE MAIN PROTOCOL

[0083] The main protocol proceeds in a series of steps as follows.

[0084] 1. SETUP: The participants run the setup protocol for the SIMULATOR-EQUIVOCAL COMMITMENTS procedure as discussed below.

[0085] 2. RESTARTING POINT: At the conclusion of the setup protocol, and periodically when the protocol returns to this point, a majority of participants agree which servers are “honest ” and what is the upper bound on the number of misbehaving parties (given that some parties have been eliminated).

[0086] 3. RUN THE DISTRIBUTED COMPUTATION OF N: There are to be n≧2t+1 (or n≧3t+1 for the more efficient multiplication protocol) shareholders S₁, . . . , Sn. For purposes of description, let L=n!. Let sp be the security parameter, and let H=2^((sp)). The goal of the protocol is to compute:

N=(p ₁ +p ₂ + . . . +p _(n))(q ₁ +q ₂ + . . . +q _(n)),

[0087]  where the p's and q's are chosen randomly by the shareholders. Steps of the computation are as follows.

[0088] Each shareholder S_(i) chooses p_(i), q_(i) ε_(R) [½ {square root}{square root over ( )}H, {square root}{square root over ( )}H] (where the subscript “_(R)” denotes “random” and the symbol ε_(R) refers to a random number in a set or interval).

[0089] Each shareholder S_(i) uses the Shamir secret sharing scheme over the integers to distribute shares of its respective p_(i) and q_(i). For description purposes, the polynomial used to share p_(i) is a_(i)(x), and the polynomial used to share q_(i) is b_(i)(x).

[0090] Each shareholder S_(i) uses the MULTIPLICATION SCHEME OVER THE INTEGERS procedure discussed below to compute N=(p₁+p₂+ . . . +p_(n)) (q₁+q₂+ . . . +q_(n)).

[0091] Each shareholder S_(i) proves to each other shareholder that its p_(i) and q_(i) are in the range [0, 3/2{square root}{square root over ( )}H] using the protocol PROOF OF KNOWLEDGE OF A DISCRETE LOG described below (over g_(*) ^(L) ² and h_(*)) with the zero-coefficient verification shares from the multiplication scheme.

[0092] If any shareholder misbehaves (as detected by failing to meet its proof), and the majority agrees that it is misbehaving, it is excluded from the rest of the protocol.

[0093] 4. Run the ROBUST DISTRIBUTED DOUBLE-PRIMALITY TEST OF N. If N fails, the current “honest” (non-excluded shareholders) repeat the protocol from the RESTARTING POINT until a value of N satisfies the primality test.

[0094] 5. Run the ROBUST DISTRIBUTED GENERATION OF PUBLIC AND PRIVATE KEYS. If N satisfies the primality test, remaining “honest” parties run one of the two protocols to determine public and private keys e and d. (The protocol for SMALL PUBLIC KEYS or LARGE PUBLIC KEYS can be chosen by system designers or operators depending on a choice of whether to use a small or large public exponent.)

[0095] The MAIN PROTOCOL uses a number of supporting protocols. Those supporting protocols are described below.

SIMULATOR EQUIVOCAL COMMITMENTS

[0096] Commitments are used to simulate in electronic communication the notion of posting a value in a sealed envelope that can only be opened in one-way (a binding property), but until opened it is concealing the value in it (a security property).

[0097] A party B can commit to value for party A, such that the commitment is binding, but a simulator could produce a commitment that is non-binding. An earlier use of such a mechanism (although it is a less efficient one) is in [IY87]. Simulator-Equivocal commitments are basically trapdoor commitments [FS89] combined with a proof of knowledge of the trapdoor.

[0098] The preferred commitment mechanism uses the following setup protocol, which only needs to be run once for any number of commitments (by itself it uses regular commitments to set up the special commitments).

[0099] SETUP:

[0100] A strong prime P and a generator g for Z*_(p) are distributively chosen using techniques known in the art.

[0101] Party A chooses a value g′ ε Z*_(p) to be used for B's commitments to A, transmits g′ to B and proves to B that it knows the discrete log of g′ base g. (This can be done using basic procedures for proving knowledge of discrete logs known in the art.)

[0102] BASIC COMMITMENTS:

[0103] In [P91], a protocol was developed in which party A can commit to a value information-theoretically, such that the commitment is computationally binding. Say there is a triple (g,h,P) with P=2P′+1 a strong prime, with the discrete log of g base h mod P unknown to A. A commits to a value x by publishing Commit=g^(x)h^(x′) mod P for a random x′. When A wishes to open the commitment, A reveals x and x′, and the other party may check if Commit≡g^(x)h^(x′) mod P. It is shown in [P91] that if A is able to open its commitment two different ways, then it would know the discrete log of g base h mod P. A commitment is constructed just as in the Basic Commitment protocol, except that g and g′ are used.

[0104] B commits to a value x ε Z_(p′) by choosing x′ ε_(R) Z_(p′) and publishing Commit=g^(x)g′^(x′) mod P.

[0105] When B wishes to open the commitment, B reveals x and x′, and A may check if Commit=g^(x)g′^(x′) mod P.

MULTIPLICATION SCHEME OVER THE INTEGERS

[0106] The scheme for multiplication over the integers is a variation of a protocol for distributed multiplication over a prime field. Multiplication over a prime field will be described first, and modifications to permit multiplication over the integers will be described second.

Sum-of-Poly Multiplication Over A Prime Field

[0107] The protocol multiplies two secret values where each is represented as a sum of polynomials. Related protocols (over prime fields only) are described in [GJKR], however, as opposed to those protocols, the protocol described here is unconditionally secure, and is based on the difficulty of discrete logs with no additional assumptions.

[0108] The scheme uses semantically-secure public-key encryption for sending private messages between servers. The severs (shareholders) S₁, . . . , S_(n) (for n≧2t+1) can perform robust multiplication over a prime field while maintaining unconditional security. The goal of the protocol is to compute C≡(A₁+A₂+ . . . +A_(n) ) (B₁+B₂+ . . . +B_(n)) mod P′ where A_(i) and B_(i) are chosen by S_(i). (The variable C as used in this section will correspond to N of the MAIN PROTOCOL, A_(n) will correspond to p_(n) of the MAIN PROTOCOL, and B_(n) will correspond to q_(n) of the MAIN PROTOCOL.) The scheme proceeds in steps as follows.

[0109] 1. SET UP

[0110] For description purposes, let P=2P′+1 be a strong prime, and let g and h be generators of Z_(p)* (such that the discrete log of h over base g is unknown). Each server S_(i) determines A_(i), B_(i) ε Z_((p)′), and performs a Shamir secret sharing of those values with random polynomials:

a _(i)(x)=Σ^(t) _(j=0) a _(i,j) x ^(j) mod P′;

and

b _(i)(x)=Σ^(t) _(j=0) b _(i,j) x ^(j) mod P′,

[0111]  where a_(i)(0)=A_(i), and b_(i)(0)=B_(i). Note that Z_(p^(′)) ≡ [1, 2, …  , P^(′)]

[0112]  Also note that each server has created a shared representation of their values A_(i), B_(i), but the servers have not yet distributed shares to other servers. If during the protocol any shareholder S_(i) is determined to be corrupt, the remaining servers assume that A_(i)=B_(i)=0 for that server, and that throughout the protocol shares A_(i)=B_(i)=0 are equal to zero.

[0113] 2. PEDERSEN SHARING OF A_(i) and B_(i)

[0114] Servers share their respective values of A_(i) and B_(i) using a modification of the Pedersen sharing scheme. While Pedersen used his sharing scheme for implementing a verifiable secret sharing, the protocol described here uses the sharing as a base for efficient, robust, secure multiplication. The inputs to the multiplication protocol are generated as follows:

[0115] (a) Each server S_(i) generates two companion secrets A′_(i), B′_(i) ε_(R) Z_(p), and shares them with Shamir secret sharing using random polynomials ${{a_{i}^{\prime}(x)} = {\sum\limits_{j = 0}^{t}{a_{i,j}^{\prime}x^{j}\quad {mod}\quad P^{\prime}}}},{{b_{i}^{\prime}(x)} = {\sum\limits_{j = 0}^{t}{b_{i,j}^{\prime}x^{j}{mod}\quad P^{\prime}}}},$

[0116]  where a′_(i)(0)=A′_(i) and b′_(i)(0)=B′_(i). Each server also publishes the Pedersen verification shares for each pair (a_(i)(x), a′_(i)(x)) and (b_(i)(x), b′_(i)(x)): α_(i,j)≡g^(a) ^(_(i,j)) h^(a) ^(_(i,j)) mod P and β_(i,j)≡g^(b) ^(_(i,j)) h^(b′) ^(_(i,j)) mod P. Each server S_(k) verifies its shares with the verification shares.

[0117] (b) For description purposes, define

[0118] A≡A₁+A₂+ . . . +A_(n) mod P′,

[0119] A′≡A′₁+A′₂+ . . . +A′_(n) mod P′,

[0120] B≡B₁+B₂+ . . . +B_(n) mod P′, and

[0121] a(x)≡Σ^(n) _(i=1)a_(i)(x) mod P′, a′(x)≡Σ^(n) _(i=1)a′_(i)(x) mod P′.

[0122] Observe that the zeroth coefficients of the polynomials a(x) and a′(x) are A and A′, respectively. Also note that the verification shares for pair (a(x), a′(x)) can be computed by all shareholders as follows:

α_(j)≡Π^(n) _(i=0) g ^(a) ^(_(i,j)) h ^(a′) ^(_(i,j)) mod P.

[0123] 3. GENERATION OF RANDOMIZING POLYNOMIALS

[0124] Each server S_(i) further generates random polynomials:

z _(i)(x)≡Σ^(2t) _(j=1) z_(i,j) x ^(j) mod P′;

and

[0125]z′ _(i)(x)≡Σ^(2t) _(j=1) z′ _(i,j) x ^(j) mod P′.

[0126] Servers distribute shares of these polynomials, and broadcast verification shares ρ_(i,j=g) ^(z) ^(_(i,j)) h^(z′) ^(_(i,j)) for 1≦j≦2t. (Note that z_(i)(0)=z′_(i)(0)=0, and ρ_(i,0)=1 for 1≦i≦n.) Each server j verifies its received polynomial shares with the received verification shares.

[0127] Each server S_(i) also generates a random polynomial r_(i)(x)≡Σ^(2t) _(j=0) r_(i,j)x^(j) mod P′, and distributes shares of this polynomial.

[0128] 4. GENERATE AND VERIFY SHARES OF RANDOMIZED A(x)B_(i)(x) and A(x)B′_(i)(x):

[0129] All shareholders locally compute shares of v_(i)(x) and v′_(i)(x) using previously received shares as:

v _(i)(x)≡a(x)b _(i)(x)+z _(i)(x);

and

v′ _(i)(x))≡a′(x)b _(i)(x)+z′ _(i)(x)=r _(i)(x).

[0130] Each server S_(i) broadcasts verification shares V_(i,j) for the polynomial pair (v_(i)(x), v′_(i)(x)) as:

V _(i,j)=Π(α_(u))^(b) ^(_(i,v)) ρ_(i,j) h ^(r) ^(_(i,j))

u+v=j

[0131] All servers S_(i) can check to see whether local shares match public shares. On a dispute as to the correct v_(i)(j) values, S_(j) challenges S_(i) to reveal the shares b_(i)(j) and r_(i)(j). All shareholders can determine if b_(i)(j) fits the verification shares for b_(i)(x), and they can check if the share v_(i)(j) fits the verification shares for v_(i)(x) by computing (g^(a(j))h^(a′(j)))^(b) ^(_(i)) ^((j)) (g^(z) ^(_(i)) ^((j))h^(z′) ^(_(i)) ^((j)))h^(r) ^(_(i)) ^((j)) mod P, where g^(a(j))h^(a′(j)) mod P can be computed from the α verification shares for (a(x), a′(x)), and g^(z) ^(_(i)) ^((j))h^(z′) ^(_(i)) ^((j)) mod P can be computed from the ρ verification shares for (z_(i)(x), z′_(i)(x)).

[0132] 5. PROVE CORRECTNESS OF VERIFICATION SHARES

[0133] For 1≦i≦n, each server S_(i) proves to all others that for 1≦j≦n, it knows representations of g^(b) ^(_(i)) ^((j))h^(b′) ^(_(i)) ^((j)) mod P and (g^(a(j))h^(a′(j)))^(b) ^(_(i)) ^((j))h^(r) ^(_(i)) ^((j)) mod P, where the discrete logs of g in the first and g^(a(j))h^(a′(j)) mod P in the second are the same. This is only necessary for the case where 2t+1≦n≦3t.

[0134] 6. OUTPUTS:

[0135] Each S_(k) computes and reveals v(k) and v′(k), where

v(x)≡Σ^(n) _(i=) v _(i)(x) mod P′;

and

v′(x)≡Σ^(n) _(i=1) v′ _(i)(x) mod P′.

[0136] Each server interpolates the resulting values to get v(0). This value is the result of the desired multiplication, because v(0)≡AB≡C mod P′.) Note that the verification shares for the polynomials v(x) and v′(x) can be computed from the verification shares from the previous step. All revealed shares are verified using the verification shares.

BASIC TECHNIQUES OVER THE INTEGERS

[0137] The MAIN protocol requires multiplication over the integers, whereas the basic scheme described above achieves multiplication over a finite field. The above scheme (over a finite field) can be modified as follows to perform multiplication over the integers.

[0138] 1. SECRET SHARING OVER THE INTEGERS [FGMYa] The Shamir secret sharing techniques over a prime field that was used above is modified with a variant for use over the integers. This is a variant of Shamir secret sharing [Sh]. For description purposes, let L=n!. For sharing a secret s ε [0,K], a party chooses a random polynomial a(x)=Σ^(t) _(j=0) a_(j)x^(j) such that a_(o)=L²s, and each other a_(j) ε_(R)[0, L, 2L . . . L³K²]. Each shareholder i ε {1, . . . , n} receives a secret share s_(i)=a(i). Any set Λ of cardinality t+1 can compute s using LaGrange interpolation.

[0139] 2. PEDERSEN UNCONDITIONALLY SECURE VSS OVER THE INTEGERS The Pederson sharing steps over a prime field that were used above are modified with a variant for use over the integers. This is a variant of Pedersen Unconditionally Secure VSS [P91]. For description purposes, assume the term “sp” is the security parameter, and let H=2^(sp). Also assume N_(*) is the product of two unknown primes, each in the range [{square root}{square root over ( )}H, 2{square root}{square root over ( )}H], and g_(*) and h_(*) are generators whose discrete Log mod N_(*) may be difficult to determine (since determining N_(*) is an object of the invention). In this case, each member S_(k), can choose a triple (N_(k),g_(k),h_(k)) and broadcast it.

[0140]  The protocol begins with n +1 secret sharings: the first being a Shamir sharing of the secret over the integers, and the next n being sharings of companion secrets using the variant of Shamir sharing over the integers as described above. Specifically, for a secret s ε [0,K], a party chooses a random polynomial a(x)=Σ^(t) _(j=0)a_(j)x^(j) such that a₀≡L²s, and each other a_(j) ε_(R) [0, L,2L, . . . , L³K²]. Then for each triple (N_(k),g_(k),h_(k)), the party chooses a random polynomial a′_(k)(x)=Σ^(t) _(j=0) a′_(j,k)x^(j) with each a′_(j,k) ε_(R) [0 . . .L³,K³]. Then the party sends shares of each polynomial to each shareholder (n+1 total shares to each shareholder) and publishes the verification shares {g_(k) ^(a) ^(_(j)) h_(k) ^(a′) ^(_(j,k)) mod N_(k)})_(o≦j≦t, 1≦k≦n). Each shareholder S_(k) can verify its shares a(k) and a′_(k′)(k) using the verification shares over N_(k′) (for all 1≦k′≦n).

[0141] 3. SUM-OF-POLY MULTIPLICATION OVER THE INTEGERS The SUM-OF-POLY MULTIPLICATION OVER A FINITE FIELD can be modified as follows to perform multiplication over the integers. The protocol is unconditionally secure, but only in the statistical sense.

[0142]  The protocol uses semantically-secure public-key encryption for sending private messages between servers. This protocol allows servers (shareholders) S₁, . . . S_(n) (for n≧2t+1) to perform robust multiplication over the integers while maintaining unconditional security. The goal of the protocol is to compute C = (A₁ + A₂ + …   + A_(n))  (B₁ + B₂+  …   + B_(n))

[0143]  mod P′ where A_(i) and B_(i) are chosen by S_(i) from the range [½{square root}{square root over ( )}H, {square root}{square root over ( )}H]. (The adversary may choose values from outside this range.)

[0144]  The protocol is the same as that of the previous section except that the share computation is performed over the integers rather than mod P′, the verification and check share computations are performed mod N_(*) rather than mod P, and with the following specific changes:

[0145] Step 1 (SETUP): For each i, the zeroth coefficients of a_(i)(x) and b_(i)(x) will be L²A_(i) and L²B_(i), respectively.

[0146] Step 2b (PEDERSON SHARING OF A_(i) and B_(i)): The zeroth coefficients of a(x) will be L²A instead of A.

[0147] Step 3 (GENERATION OF RANDOMIZING POLYNOMIALS): The coefficients of z_(i)(x) and z_(i)′(x) will be drawn as follows: z_(i,j) ε_(R) [0, L¹¹H³] and z′_(i,j) ε_(R) [0,L¹¹H⁴]. The coefficients of r_(i)(x) will be drawn as follows:

r_(ij) ε_(R) [0,L¹¹H⁴].

[0148] Step 6 (OUTPUT): Finally, v(0) will be L⁴AB instead of AB, so participants divide by L⁴.

ROBUSTNESS TOOLS

[0149] Proofs of knowledge use the commitment tools chosen in the set up. These tools allow servers to perform efficient constant-round zero-knowledge proofs.

[0150] 1. PROOF OF KNOWLEDGE OF A DISCRETE LOG

[0151]  A zero-knowledge interactive proof in which a prover

proves knowledge to a verifier

of a discrete log (or any isomorphic function) of X=g^(x) mod P was presented in [GHY85]. Below we demonstrate a similar proof based on a composite modulus, N, and input X=g^(x) mod N, where x ε [0 . . . Z], for some Z≧1.

[0152]

commits to a randomly chosen sp-bit string c=c₁|| . . . ||c_(sp) using a Simulator-Equivocal commitment, and also transmits (g^(q) ^(₁) mod N, . . . , g^(q) ^(_(sp)) mod N) where q_(i) ε_(R) [0. . . Z].

[0153]

sends a randomly chosen sp-bit string c′=c′₁|| . . . ||c′_(sp) P.

[0154]

opens its commitment. For k=1 . . . sp, P transmits v_(k)=d_(k)x+q_(k)., where d=c ⊕ c′.

[0155] For k=1 . . . sp,

verifies whether X^(d) ^(_(k)) g^(q) ^(_(k))

g^(v) ^(_(k)) mod N.

[0156] 2. PROOF OF KNOWLEDGE OF A DISCRETE LOG AND A CORRESPONDING REPRESENTATION

[0157]  For a prover

to prove that it knows a representation (x,y) of Y=g_(*) ^(x)h_(*) ^(y)/Y mod N_(*), and that the first part of the representation is equivalent to the discrete log of X=g^(x) mod N, with x, y ε [0 . . . Z], the following protocol is used:

[0158]

commits to a randomly chosen sp-bit string c=c₁|| . . . c||_(sp) using a Simulator-Equivocal commitment, and also transmits ((g^(q) ^(₁) mod N,g_(*) ^(q) ^(₁) h_(*) ^(q′) ^(₁) mod N_(*)), . . . , (g^(q) ^(_(sp)) mod N, g_(*) ^(q) ^(_(sp)) h_(*) ^(q′) ^(_(sp)) mod N_(*))) where q_(i), q′₁ ε_(R) [0 . . . Z(N+N_(*))].

[0159]

sends a randomly chosen sp-bit string c′=c′₁|| . . . ||c′_(sp) to

.

[0160]

opens its commitment. For k=1 . . . sp,

transmits v_(k)=d_(k)x+q_(k) and v′_(k)=d_(k)y+q′_(k), where d=c ⊕ c′.

[0161] For k=1 . . . sp,

verifies whether X^(d) ^(_(k)) g^(q) ^(_(k)) =g^(v) ^(_(k)) mod N, and y^(d) ^(_(k)) g_(*) ^(q) ^(_(k)) h_(*) ^(q′) ^(_(k)) ≡g_(*) ^(v) ^(_(k)) h_(*) ^(v′) ^(_(k)) mod N_(*).

[0162] 3. PROOF OF KNOWLEDGE OF CORRESPONDING REPRESENTATIONS

[0163]  For a prover

to prove that it knows values y and y′ such that if (x,y) is a representation of X=g^(x) _(*)h^(y) _(*) mod N_(*) over g_(*) and H_(*), and (x′,y′) is a representation of Y=g_(*) ^(x′)h_(*) ^(y′) mod N_(*) over g_(*) and h_(*), then x=x′, the following protocol is used:

[0164]

commits to a randomly chosen sp-bit string c=c₁|| . . . ||c_(sp) using a Simulator-Equivocal commitment, and also transmits ((g¹ ^(_(q)) h_(*) ^(q) ^(₁) ^(′) mod N_(*),g_(*) ^(q1)h_(*) ^(q) ^(₁) ^(″) mod N_(*)), . . . , (g_(*) ^(q) ^(_(sp)) h_(*) ^(q′) ^(_(sp)) mod N_(*),g_(*) ^(q) ^(_(sp)) h_(*) ^(q″) ^(_(sp)) mod N_(*))) where q_(i), q′_(i), q_(i)″ ε_(R)[0 . . . Z(N+N_(*))].

[0165]

sends a randomly chosen sp-bit string c′=c′₁|| . . . ||c′_(sp) to

.

[0166] P opens its commitment. For k=1 . . . sp, P transmits v_(k) = d_(k)x + g_(k), v_(k)^(′) = d_(k)y + q_(k)^(′),  and  v^(″)k = d_(k)y^(′) + q_(k)^(″),

[0167]  where d=c ⊕ c′.

[0168] For k=1 . . . sp,   verifies  whether  X^(d_(k))g*^(q_(k))h*^(q^(′)k) = g_(*)^(v_(k))h_(*)^(v^(′)k)  mod  N_(*)

[0169]  and whether Y^(d) ^(_(k)) g_(*) ^(q) ^(_(k)) h_(*) ^(q″) ^(_(k)) =g_(*) ^(v) ^(_(k)) h_(*) ^(v″) ^(_(k)) mod N_(*).

[0170] 4. PROOF OF KNOWLEDGE AND RANGE OF A REPRESENTATION

[0171]  The protocol below allows a prover

to prove that it knows values x and y such that (x,y) is a representation of X=g_(*) ^(x)h_(*) ^(y) mod N_(*) over g_(*) and h_(*), where y ε [0 . . . Z], and x ε [a−w . . . b+w], where w = a − b.

[0172]  If x ε [a . . . b], this protocol is zero-knowledge. (Assume [a−w . . . b+w]

C [9 . . . Z].)

[0173]

commits to a randomly chosen sp-bit string c=c₁|| . . . ||_(sp) using a Simulator-Equivocal commitment, and also transmits ({g_(*) ^(q) ^(₁) h_(*) ^(q′) ^(₁) mod N, g_(*) ^(q) ^(_(1-w)) h_(*) ^(q) ^(₁) ^(″) mod N_(*)}, . . . (g_(*) ^(q) ^(_(sp)) h_(*) ^(q′) ^(_(sp)) mod N, g^(q) ^(_(sp)) ^(-w)h_(*) ^(q) ^(_(sp)) ^(″) mod N_(*)}) where q_(i), ε_(R) [0, w], q′_(i), q″_(i) ε_(R) [0 . . . ZN*]. Notice that the pairs are unordered.

[0174]

sends a randomly chosen sp-bit string c′=c′₁|| . . . ||c′_(sp) to

.

[0175]

opens its commitment. Let d=c ⊕ c′. For k=1 . . . sp, if d_(k)=1,

transmits q_(k), q′_(k), and q″_(k) and otherwise transmits v_(k)=x+q_(k) and v′_(k)=y+q′_(k), or v_(k)=x+q_(k)−e and v′_(k)=y+q″_(k) whichever has v_(k) ε[a . . . b].

[0176] For k=1 . . . sp, if d_(k)=1,

verifies q_(k) ε[0 . . . e] and g_(*) ^(q) ^(_(k)) h_(*) ^(q′) ^(_(k)) mod N_(*) and g_(*) ^(q) ^(_(k)) ^(-e)h_(*) ^(q″) ^(_(k)) mod N_(*) were the components of the kth pair transmitted by

, and otherwise=

verifies v_(k) ε[a . . . b] and that g_(*) ^(q) ^(_(k)) h_(*) ^(v′) ^(_(k)) /mod N_(*) is equivalent to one of the components of the kth pair transmitted by

.

ROBUST DISTRIBUTED DOUBLE-PRIMALITY TEST

[0177] The preferred method uses a double-prime test scheme based on a prior one by Boneh-Franklin but modified to be robust and to “chain” the robustness tools to the preceding generation of the value n. In this method, servers can check whether a previously computed value N is the product of two large prime numbers (a condition that is required for using N in certain signature and other cryptographic schemes). To get robustness (e.g., to determine that N is double prime even if one server participating in the protocol is corrupt) the protocol makes use of a polynomial for each server S_(i) defined as:

f _(i)(x)=a _(i)(x)+b _(i)(x)=Σ^(t) _(j=0) f _(i,j) x ^(j),

[0178] where a_(i)(x) and b_(i)(x) were used to distribute p_(i) and q_(i) respectively in the Distributed Computation of N. The preferred method also uses the corresponding check shares used in the Pedersen sharing steps. For description purposes, these check share will be called γ_(i,j) for 0≦j≦t, with

γ_(i,0) ≡g _(*) ^(L) ² ^((p) ^(_(i)) ^(+q) ^(_(i)) ⁾ h _(*) ^((p′) ^(_(i)) ^(q′) ^(_(i)) ⁾ mod N_(*),

[0179] where p′_(i) and q′_(i) are the companion secrets to p_(i) and q_(i), respectively.

[0180] The parties repeat the following steps as many times as necessary get the desired security level. Each successful repetition increases the confidence that the computed value N is double prime. A failure of any repetition indicates that N is not double prime, and the servers return to the RESTARTING POINT to compute a new value of N.

[0181] 1. The shareholders randomly choose g such that:

(g/n)=1

[0182]  where “(g/n)” here designates the Jacoby symbol.

[0183] 2. A first server S₁ computes and broadcasts a value

Q ₁ =g ^((N+1−p) ^(_(i)) ^(−q) ^(_(i)) ^()/4) mod N.

[0184]  Then the first server proves knowledge of the discrete log of Q₁ and a corresponding representation of g_(*) ^(L) ² ^(N+1) γ_(1,0) ⁻¹ (over g_(*) ^(4L) ² and h_(*)) using the protocol in PROOF OF KNOWLEDGE OF A DISCRETE LOG.

[0185] For each i≧1 (i.e., remaining servers), each server S_(i) broadcasts Q_(i)=g^((p) ^(_(i)) ^(+q) ^(_(i)) ^()/4) mod N. Then it proves knowledge of the discrete log of Q_(i) and a corresponding representation of γ_(i,0) (over g_(*) ^(4L) ² and h*) using the protocol in PROOF OF KNOWLEDGE OF A DISCRETE LOG.

[0186] 3. All shareholders verify that Q₁/Π^(n) _(i=2)Q_(i)≡±1 mod N. (Here, the symbol “≡” means “is congruent with.”) If it is not congruent, the servers declare that N is not a product of two primes.

ROBUST DISTRIBUTED GENERATION OF PUBLIC AND PRIVATE KEYS

[0187] The key generation step makes use of the relationship that φ(N)=N−Σ^(n) _(i=1)(p_(i)+q_(i))+1(φ(N) is the Euler function). The preferred protocol uses one of two procedures, a simple one for small public keys and a more complicated one for larger (general) public keys.

[0188] Certain operations can be easily done (while maintaining checking information to assure robustness) if a change of representation of the shared value is first performed. A “poly-to-sum” technique is used which transforms a function shared by a t degree polynomial amongst n servers into a t-out-of-t additive (sum) sharing. A “sum-to-poly” technique which transforms a function shared additively t-out-of-t into a t-out-of-n polynomial sharing. Share representation transformation techniques from [FGMYa] may be employed.

KEY GENERATION FOR SMALL PUBLIC KEYS

[0189] For small public keys, e.g., an RSA system where e=3, the following procedure may be used.

[0190] 1. Shareholders jointly choose g ε_(R)[1,N−1] using techniques described in SIMULATOR-EQUIVOCAL COMMITMENTS. In this procedure, each server commits to a value g_(i), and after all participants reveal g_(i), all participants can compute g as the product of g_(i).

[0191] 2. Each shareholder S_(i) broadcasts “check shares” g^(p) ^(_(i)) ^(+q) ^(_(i)) mod N.

[0192] 3. Each shareholder S_(i) checks that value against Q_(i) ⁴ mod N. Actually S₁ checks it against g^(N+1)/Q₁ ⁴ mod N.

[0193] 4. Each shareholder S_(i) reveals x_(i)=p_(i)+q_(i) mod 3.

[0194] 5. Each shareholder S_(i) proves knowledge of the discrete log of x=g^(p) ^(_(i)) ^(+q) ^(_(i)) g^(−x) ^(_(i)) mod N with base g″=g³ (which can be accomplished using the techniques described in PROOF OF KNOWLEDGE OF A DISCRETE LOG). That is, each shareholder S_(i) shows that it knows a value r such that p_(i)+q_(i)−x_(i)=3r by showing that it knows the exponent of X with base g″.)

[0195] 6. The next step utilizes the fact that:

φ(N)≡N+1−Σ^(n) _(i=1) x _(i) mod 3.

[0196]  For description purposes, let

r=N+2−Σ^(n) _(i=1) x _(i);

r′=2N+3−2 Σ^(n) _(i=1) x _(i).

[0197]  All servers can compute these values.

[0198]  If φ(N)=2 mod 3, the first shareholder S₁ computes its share of d as d₁=(r−(p₁+q₁−x₁)/3 (case 1), and for 2≦i≦n, each remaining shareholder S_(i) computes is share of d as d_(i)=−(p_(i)+q_(i)−x_(i))/3 (case 2).

[0199] If φ(N)≡1 mod 3, the first shareholder S₁ computes its share of d as d₁=(r′−2(p₁+q₁−x₁))/3 (case 3), and for 2≦i≦n, each remaining shareholder S_(i) computes its share of d as d_(i)=−2(p_(i)+q_(i)−x_(i))/3 (case 4). (Recall that the value d is a secret, and the generation of shares of d without actually generating d is an object of the invention.)

[0200] 7. All shareholders check that the check shares cubed are correct when compared against the check shares broadcast in step 2. For example, in case 1 above, the first server starts with g^(d) ^(₁) and raises it to the power 3. The first server than multiplies the result by the inverse of g^(r+x) ^(₁) . The result should be equal to the inverse of g^(p) ^(₁) ^(+q) ^(₁) which was broadcast in step 2.

[0201] 8. A sum-to-poly transformation is performed to construct a (t,n)-secure polynomial sharing of d. The resultant shares can be used as shares of a secret encryption key for, e.g., distributed signing procedures in a root certification authority.

KEY GENERATION FOR LARGE PUBLIC KEYS

[0202] For e large, the preferred protocol uses different techniques for finding (φ(N))⁻¹ mod e which are related to ideas described by Boneh and Franklin. The preferred protocol takes advantage of an assumption that a value e can be found that is a prime, with E=2e+1 a (strong) prime. Earlier steps in the method utilized a definition that for 1≦i≦n, f_(i)(x)=a_(i)(x) +b_(i)(x). For description purposes, let f(x)=L²(N+1)−Σ^(n) _(i=1)f_(i)(x). Then f(0)=L²φ(N). The preferred method proceeds with the following steps.

[0203] 1. Shareholders jointly choose e randomly (using procedures from SIMULATOR-EQUIVOCAL COMMITMENTS), and test to see that e and 2e+1 are prime.

[0204] 2. Shareholders jointly choose g_(e), h_(e) ε_(R) Z*_(E) (again using procedures from SIMULATOR-EQUIVOCAL COMMITMENTS).

[0205] 3. Shareholders jointly choose g, h ε Z^(*) _(N) (using procedures from SIMULATOR-EQUIVOCAL COMMITMENTS). (Shareholders may choose polylog of them and repeat the checking process with all of them, which assures generators of large order.)

[0206] 4. Each shareholder S_(i) chooses m_(i) ε_(R) [0,H], and performs a Shamir sharing of m_(i) over the integers. For description purposes, let

m=m ₁+ . . . +m_(n).

[0207]  Then m will be random. Using addition of shares, shareholders can hold the share of the addition. For the purpose of description, this added polynomial will be called fm, where fm(0)=L²m as its zero coefficient.

[0208] 5. The shareholders perform a MULTIPLICATION OVER A FINITE FIELD (order e) to calculate D=L⁴φ(N)m mod e (with all values of the Shamir sharing of each m_(i) taken mod e). This is done by multiplying f and fm. For notation purposes, let INV=D⁻¹ mod e, which is easily calculated from the public value D. (Note that D has been “randomized” by the value of m and looks arbitrary so that its public availability will not give away information about φ(N)).

[0209] 6. For each i,j, each shareholder S_(i) multiplies its integer share of m_(j) by INV. (Note that m is the sum of m_(i) and there is a polynomial for each m_(i), therefore, the protocol produces a “sum-of-poly” representation.) This gives the servers integer sharings of polynomials whose sum contains a secret:

W≡(L ⁴φ(N)⁻¹ mod e

[0210]  which, when multiplied by L², is the sum polynomials value at zero.

[0211] 7. The shareholders perform a multiplication over the integers with check shares over N (of this latest polynomial and f(x) to get a polynomial sharing with −L⁴Wφ(N)+1 in the zero coefficient. (To add one, simply add one to all the resulting shares; to multiply by −1, multiply all shares by −1.) Then, instead of revealing the shares of the resulting polynomial, shareholders reveal those shares only in the exponent. For example, assuming the resulting polynomial is v(x) and the resulting companion polynomial is v′(x), instead of S_(i) revealing v(i) and v′(x), it reveals g^(v(i)) mod N and h^(v′(i)) mod N, and proves that it knows the actual shares using the protocol from PROOF OF KNOWLEDGE OF A DISCRETE LOG. Note that v(0)≡((−1)+1)=0 mod e, and v(0)≡1 mod φ(N).

[0212] 8. The shareholders perform a poly-to-sum to have the secret sum distributed to t+1 shareholders.

[0213] 9. The t+1 shareholders divide their additive shares by e, and publish the remainders. Also they publish the check shares for the new additive shares. (All shareholders should check these check shares by raising them to the e power and comparing them to the original additive shares g^(v(0)).) The remainders will sum to a multiple of e. One of the shareholders adds this multiple to its additive share. Then these shareholders collectively hold an additive sharing of d.

[0214] 10. The t+1 shareholders perform a sum-to-poly to construct a (t,n)-secure polynomial sharing of d.

EFFICIENCY OF THE PROTOCOL AND VARIATIONS

[0215] In typical systems, h can be on the order of 1000 (i.e., 1024-2048). Working over the integers will add Less than 400 to the size of exponents, assuming that assurance of 2⁻⁴⁰ is reasonable. It can be expected that the value n will be less than 10, and 2−k⁻⁴ chance of error on proofs with k=40 to be sufficient assurance of correctness.

[0216] The probability of generating an RSA modulus from two random primes of sp/2 bits each is about (sp/2)⁻², so the procedure is expected to repeat for about sp²/4 rounds. The communication complexity of each round is bounded by O(nk(sp)) and the computational complexity of each round is about O(n(k+t)) modular exponentiations. Given realistic values of k and t, the computational complexity is dominated by the multiplication protocol and would be about 24n(t+1) modular exponentiations. Not much efficiency can be gained by performing trial division as discussed by Boneh and Franklin, since each trial against a small prime would involve a robust multiplication, and thus around O(ntB/lnB) modular exponentiations for each distributed integer tested.

[0217] Numerous practical improvements can be made. First, trial division can be done once a possible N is generated, and this would eliminate many distributed double-primality tests. Also, if the test that each p_(i) and q_(i) are in the correct range is done after this trial division, then many of those can be saved. (In this case, N needs to be tested to make sure it is in a possible range, so that flagrant misbehavior of shareholders can be determined.)

[0218] Perhaps the largest improvement would come from revealing the value of each p_(i) mod-the-product-J-of-small-primes-up-to some-B, and assuming the shared value is a multiple of the J. The sum of the revealed values could be tested to see if it is divisible by any of the small primes up to B. If so, the distributed integer would not be prime and would be thrown out. Of course, this reduces security, so it would preferably be done for primes up to, e.g., 7. This reduces the security by about 6 bits (log((2−1)(3−1)(5−1)(7−1))), but would increase the probability that the number is prime by a factor of about 5, and thus reduce the expected number of rounds for the protocol by a factor of about 25. (If the reduction in security is worrisome, sp could be slightly increased without affecting the running time significantly. Or one could only use primes 2 and 3, reducing the security by about 1 bit, while reducing the expected number of rounds for the protocol by about 6.)

[0219] With the improvements described above, the total number of modular exponentiations in the protocol will be about 24n(t+1) times (sp/10)² (reduced from (sp/2)² because of the substitute for trial division), which is about 10,000. For the case n=4 and t=1, there are 2,000,000 modular exponentiations. The non-robust protocol of Boneh-Franklin using trial division up to 8,103 performs about 484 modular exponentiations, about a factor of 4000 less.

[0220] If it is likely that all parties are honest, one can increase performance by performing “optimistic execution”. The idea is to run the protocol (plus the trial division from Boneh-Franklin) but without any checking information. That is, there would be no companion polynomials or verification shares generated. At the end of each round in which the participants failed to produce an RSA modulus, they reveal all their information from the round. If all participants agree that the information revealed is correct, then there has been no cheating in that round, and they proceed. If cheating is ever found, they revert to the robust protocol described in this paper. If an RSA modulus is found, then they rerun the round using the same polynomials sharings, but including the robustness checks (i.e., companion polynomials, verification shares, proofs of knowledge). If all the information is verified correctly, then they use the RSA modulus. Otherwise, cheating has occurred and they revert to the robust protocol.

[0221] The problem with this “mode” of operation is that cheating can be detected, but it is impossible to determine exactly which participant cheated. To determine who cheated, one can require that participants sign their messages to other participants, and have recipients of messages either accept the signature or ask the sender to reveal the message to everyone. Assuming the signatures are RSA signatures on participants private keys, one can assume that they require a single modular exponentiation. Furthermore, one could use one signature per round, or even over multiple rounds, to reduce the number of modular exponentiations. In all, this method will still be robust and secure (with some standard assumptions about security and robustness of signatures and encryptions), but require only about n² times the modular exponentiation of the non-robust protocol, where n is the number of participants. (Note that this only works when n is greater than 3t+1], because one cannot use zero knowledge [ZK] proofs to guarantee correct shares in the multiplication protocol.)

[0222] Performance can also be improved by using a faster modular exponentiation algorithm, as in [BGM], since in these robust protocols, participants will be performing many exponentiations over the same base and modulus.

[0223] Another source of efficiency may come from collapsing rounds in the zero-knowledge proofs by using the known method of self-challenging string derived from a common one-way hash function believed to be computationally indistinguishable from a random oracle [FS86].

[0224] The supporting protocols can be combined to improve many of the applications of mathematical operations over distributed values or cryptographic keys. Such operations involve multiplication, inversion, additional, and exponentiation. One example mentioned above is the DSS distributed protocol.

VARIATIONS ON THE PROTOCOL

[0225] Once a composite N is established there are numerous ways to use it in various cryptographic protocols other than as a distributed RSA system:

[0226] 1. The parties can initiate a “composite ElGamal” system. They draw a random element g and generate public key y =g^(x) where x is shared among the parties using either an additive or polynomial sharing scheme.

[0227] 2. Users register for an identification protocol by using the availability of N to generate a quadratic residue for which they keep the root as a secret.

[0228] 3. Users can engage in the Yao's secret bit exchange protocol, where they both encrypt the value under N and simultaneously reveal the decryption bit by bit.

[0229] 4. Using (e, N), users can use RSA as a public commitment scheme (i.e., using it as a one-way function) which cannot be opened unless the majority wants to do it. One application for this is the escrow of plain texts. 

1. A method for generating a cryptographic key in the form of key shares distributed among a number of participating servers comprising the steps of: each server generating secret values; distributively computing a composite value N from the secret values; distributively testing N for a double primality condition; and if N satisfies the double primality condition, distributively generating a public key and private shares of a corresponding private key. 